A Response to 'Dismantling Monuments'

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monuments to Academic Carelessness

In 1942, Katherine Frost Bruner published an article titled ‘‘Of psychological writing: Being some valedictory remarks on style.’’ It was published in Journal of Abnormal and Social Psychology, the journal for which she served as editorial assistant between 1937 and 1941. Her collection of advice to writing scholars has been widely quoted, including by several editions of The Publication Manual...

متن کامل

Other monuments to inhalation anesthesia.

THE history of anesthesiology is one commemorated by several monuments. The most recognized memorial is the Ether Monument, erected in the Boston Public Garden in 1868. While many anesthesiologists are familiar with this sculpture, there are other less-known memorials related to the introduction of surgical inhalation anesthesia and to the claimants to its discovery. This article discusses some...

متن کامل

Dismantling Lamarckism

This paper addresses the widespread tendency to describe socio-economic evolution as Lamarckian. The difference between Lamarckian and Darwinian replication is clarified. It is shown that a phenotype-genotype distinction must first be established before we can identify Lamarckian transmission. To qualify as Lamarckian inheritance, acquired properties at the phenotypic level must be encoded in a...

متن کامل

Network dismantling

We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of vertices, leaving the graph acyclic). Exploiting this connection and recent works on epidemic spr...

متن کامل

Dismantling DivSufSort

We give the first concise description of the fastest known suffix sorting algorithm in main memory, the DivSufSort by Yuta Mori. We then present an extension that also computes the LCP-array, which is competitive with the fastest known LCParray construction algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2019

ISSN: 1556-5068

DOI: 10.2139/ssrn.3334196